Parallel Processing Approach for Pattern Matching using MPI
نویسندگان
چکیده
منابع مشابه
Multiple-Pattern Matching Using Improved Bit-Parallel Approach
We consider a fundamental problem testing if every bit is zero in a bit vector in a so-called bit-parallel machine. In this machine, a machine word can have unlimited number of bits, and logical operations such as bitwise-and, bitwise-or, and so on, can be done in O(1) time. However, in each time, only one bit in a bit vector can be examined. We show how to solve this fundamental problem in O(1...
متن کاملParallel Implementation of Exact Two Dimensional Pattern Matching Algorithms using MPI and OpenMP
The need for processing power is constantly increasing as more processing-demanding and time-critical applications appear. Parallel processing has emerged as an efficient and costeffective solution, since low-end workstations and multiprocessors are cheaply available in the commodity market. In this paper, experimental results are presented on the parallel processing of the Naive, Karp and Rabi...
متن کاملParallel Overlapped Block-Matching Motion Compensation Using MPI and OpenMP
Overlapped block-matching motion compensation (OBM) enhances the prediction results of classical non-overlapped block-matching in the context of video compression significantly and is especially well suited for wavelet-based video coding. However, this is achieved at a high additional computational cost. We investigate possibilities for parallelization of two classical OBM algorithms and invest...
متن کاملPattern Matching of Collective MPI Operations
Programming message passing systems can be tedious and error-prone, especially for the inexperienced user facing the sheer amount of available functionality in todays message passing libraries. Instead of choosing the most optimal communication function, many users tend to apply only a small set of well-known standard operations. This paper describes a pattern matching approach based on executi...
متن کاملParallel Vectoring Algorithm for Pattern Matching
The main aim of this study is to propose efficient algorithms for image template matching on parallel machines. To our knowledge there is no a template matching algorithm that converts the template image and all candidate blocks in the source image from two-dimensions into one-dimension. This study proposes a Template Matching Vectoring Algorithm (TMVA) that reduces the amount of data to be ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018916230